Convergence of the Fraser-Hart Algorithm for Rational Chebyshev Approximation
نویسندگان
چکیده
منابع مشابه
On Convergence and Degeneracy in Rational Padi and Chebyshev Approximation *
We study two questions associated with rational approximation of a function f(z) near the origin z-0: continuity of the Pad approximation operator, and convergence of Chebyshev to Pad ap-proximants as the domain of approximation shrinks to a point. Both become delicate in the case of degenerate approximations, i.e. approximations whose numerator and denominator are deficient in degree. In this ...
متن کاملGeneralized Rational Chebyshev Approximation
In this paper, a generalized rational Chebyshev approximation problem is considered. The problem is this: To minimize the maximum absolute value of the "criterion function" of the error. By imposing a rather natural restriction on the criterion function, the problem is solved completely; the existence, the uniqueness and the characterization of the best approximation are clarified and interesti...
متن کاملRational Chebyshev Approximation on the Unit Disk
In a recent paper we showed that er ror curves in po lynomia l Chebyshev a p p r o x i m a t i o n of ana ly t ic functions on the unit disk tend to a p p r o x i m a t e perfect circles abou t the origin [23]. M a k i n g use of a theorem of Ca ra th6odo ry and Fej6r, we der ived in the process a me thod for calculat ing near-bes t a p p r o x i m a t i o n s rapid ly by finding the pr incipal...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولModified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1975
ISSN: 0025-5718
DOI: 10.2307/2005745